Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
نویسندگان
چکیده
منابع مشابه
Maximal Prime Subgraph Decomposition of Bayesian Networks: A Relational Database Perspective
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method was proposed to construct an MPD-JT from a BN. In this paper, we present a new method from a relational database (RDB) perspective which sheds light on the semantic meaning of the previously proposed graphical algorithm.
متن کاملMaximal Prime Subgraph Decomposition of Bayesian Networks
The authors present a method for decomposition of Bayesian networks into their maximal prime subgraphs. The correctness of the method is proven and results relating the maximal prime subgraph decomposition (MPD) to the maximal complete subgraphs of the moral graph of the original Bayesian network are presented. The maximal prime subgraphs of a Bayesian network can be organized as a tree which c...
متن کاملConstructing the Maximal Prime Decomposition of Bayesian networks
The maximal prime decomposition (MPD) of a Bayesian network is a hierarchical structure, which represents conditional independency information. The MPD representation has shown to facilitate probabilistic inference in uncertainty management. One method for building the MPD involves applying the moralization and triangulation procedures to the given Bayesian network. An alternative method constr...
متن کاملCritical Remarks on the Maximal Prime Decomposition of Bayesian Networks
We present a critical analysis of the maximal prime decomposition of Bayesian networks (BNs). Our analysis suggests that it may be more useful to transform a BN into a hierarchical Markov network.
متن کاملTriangulation of Bayesian Networks: A Relational Database Perspective
In this paper, we study the problem of triangulation of Bayesian networks from a relational database perspective. We show that the problem of triangulating a Bayesian network is equivalent to the problem of identifying a maximal subset of conflict free conditional independencies. Several interesting theoretical results regarding triangulating Bayesian networks are obtained from this perspective.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2007
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2006.09.007